Advertising network formation based on stochastic diffusion search and market equilibria

نویسندگان

  • Nikos Salamanos
  • Stavros Lopatatzidis
  • Michalis Vazirgiannis
  • Antonis Thomas
چکیده

The concept of social networks in conjunction with concepts from economics has attracted considerable attention in recent years. In this paper we propose the Stochastic Diffusion Market Search (SDMS), a novel contextual advertising method for mutual advertisement hosting among participating entities, where each owns a web site. In the scenario considered each participating agent/web-site buys or sells advertising links. In the proposed method the advertising market and network that formed into the system emerge from agents preferences and their social behavior into the network. SDMS consists of a variation of Stochastic Diffusion Search, a swarm intelligence metaheuristic, and an algorithm for market equilibria. We present an evaluation of the model and the experimental results show that the network potentially converges to a stable stage and the distribution of market prices adheres to power law properties.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A stochastic network design of bulky waste recycling – a hybrid harmony search approach based on sample approximation

Facing supply uncertainty of bulky wastes, the capacitated multi-product stochastic network design model for bulky waste recycling is proposed in this paper. The objective of this model is to minimize the first-stage total fixed costs and the expected value of the second-stage variable costs. The possibility of operation costs and transportation costs for bulky waste recycling is considered ...

متن کامل

On the Equilibria and Efficiency of the GSP Mechanism in Keyword Auctions with Externalities

In the increasingly important market of online search advertising, a multitude of parameters affect the performance of advertising campaigns and their ability to attract users’ attention enough to produce clicks. Thus far, the majority of the relevant literature assumed an advertisement’s probability of receiving a click to be dependent on the advertisement’s quality and its position in the spo...

متن کامل

Solving a Two-Period Cooperative Advertising Problem Using Dynamic Programming

Cooperative advertising is a cost-sharing mechanism in which a part of retailers' advertising investments are financed by the manufacturers. In recent years, investment among advertising options has become a difficult marketing issue. In this paper, the cooperative advertising problem with advertising options is investigated in a two-period horizon in which the market share in the second period...

متن کامل

A Novel Charging Plan for PEVs Aggregator Based on Combined Market and Network Driven Approach

With the large-scale production of plug-in electric vehicles (PEVs), a new entity, the PEV fleet aggregator manages charging and discharging processes of the vehicles. The main objective of an individual aggregator in interaction with electricity markets is maximizing its profit. In this paper, the performance of this aggregator in day-ahead and real-time electricity markets, considering (a) cu...

متن کامل

Training Radial Basis Function Neural Network using Stochastic Fractal Search Algorithm to Classify Sonar Dataset

Radial Basis Function Neural Networks (RBF NNs) are one of the most applicable NNs in the classification of real targets. Despite the use of recursive methods and gradient descent for training RBF NNs, classification improper accuracy, failing to local minimum and low-convergence speed are defects of this type of network. In order to overcome these defects, heuristic and meta-heuristic algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010